An Algorithmic Proof for the Induction of M-convex Functions through Networks

Quite recently, Murota introduced an M-convex function as a quantitative generalization of the set of integral points in a base polyhedron, as well as an extension of valuated matroid over base polyhedron. Just as a base polyhedron can be transformed through a network, an M-convex function can be induced through a network. This paper gives an algorithmic proof for the induction of an M-convex function. The proof is based on the correctness of a simple algorithm, which e ciently nds an exchangeable element with a novel operation called crossover. We also analyze a behavior of induced functions when they take the value 1: